Optimizing node discovery on networks: Problem definitions, fast algorithms, and observations
نویسندگان
چکیده
منابع مشابه
Fast approximation algorithms for finding node-independent paths in networks
A network is robust to the extent that it is not vulnerable to disconnection by removal of nodes. The minimum number of nodes that need be removed to disconnect a pair of other nodes is called the connectivity of the pair. It can be proved that the connectivity is also equal to the number of node-independent paths between nodes, and hence we can quantify network robustness by calculating number...
متن کاملNode discovery problem for a social network
This paper presents a practical heuristic algorithm to address a node discovery problem. The node discovery problem is to discover a clue on the person, who does not appear in the observed records, but is relevant functionally in affecting decision-making and behavior of an organization. We define two topological relevance of a node in a social network (global and local relevance). Association ...
متن کاملOptimizing Multiple Response Problem Using Artificial Neural Networks and Genetic Algorithm
This paper proposes a new intelligent approach for solving multi-response statistical optimization problems. In most real world optimization problems, we are encountered adjusting process variables to achieve optimal levels of output variables (response variables). Usual optimization methods often begin with estimating the relation function between the response variable and the control variab...
متن کاملOn Influential Node Discovery in Dynamic Social Networks
The problem of maximizing influence spread has been widely studied in social networks, because of its tremendous number of applications in determining critical points in a social network for information dissemination. All the techniques proposed in the literature are inherently static in nature, which are designed for social networks with a fixed set of links. However, many forms of social inte...
متن کاملOptimizing Multiple Objectives on Multicast Networks using Memetic Algorithms
In this paper, we propose the use of Memetics Algorithms for solving multiobjective network problems. The aim is to minimize total delay and total hop count on sending a multicast flow through a network. We propose a heuristic that avoid the creation of subgraphs for finding paths. The heuristic combined with multiobjective evolutionary algorithms have shown similar results to the results obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2019
ISSN: 0020-0255
DOI: 10.1016/j.ins.2018.10.036